Chebyshev-Vandermonde systems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Vandermonde systems on Gauss-Lobatto Chebyshev nodes

This paper deals with Vandermonde matrices Vn whose nodes are the Gauss–Lobatto Chebyshev nodes, also called extrema Chebyshev nodes. We give an analytic factorization and explicit formula for the entries of their inverse, and explore its computational issues. We also give asymptotic estimates of the Frobenius norm of both Vn and its inverse and present an explicit formula for the determinant o...

متن کامل

Vandermonde Matrices with Chebyshev Nodes

For n × n Vandermonde matrix Vn = (αi−1 j )1≤i j≤n with translated Chebyshev zero nodes, it is discovered that V T n admits an explicit QR decomposition with the R-factor consisting of the coefficients of the translated Chebyshev polynomials of degree less than n. This decomposition then leads to an exact expression for the condition number of its submatrix Vk,n = (αi−1 j )1≤i≤k,1≤j≤n (so-calle...

متن کامل

Generalized Vandermonde Determinants over the Chebyshev Basis

It is a well known fact that the generalized Vandermonde determinant can be expressed as the product of the standard Vandermonde determinant and a polynomial with nonnegative integer coefficients. In this paper we generalize this result to Vandermonde determinants over the Chebyshev basis. We apply this result to prove that the number of real roots in [1;1] of a real polynomial is bounded by th...

متن کامل

Fast inversion of Chebyshev { Vandermonde matrices 1

This paper contains two fast algorithms for inversion of ChebyshevvVander-monde matrices of the rst and second kind. They are based on special representations of the Bezoutians of Chebyshev polynomials of both kinds. The paper also contains the results of numerical experiments which show that the algorithms proposed here are not only much faster, but also more stable than other algorithms avail...

متن کامل

How (Un)stable Are Vandermonde Systems?

Many problems in applied and numerical analysis eventually boil down to solving large systems of linear algebraic equations. Since the matrices and right-hand sides of such systems are typically the result of (sometimes extensive) computations, they are subject to an unavoidable level of noise caused by the rounding errors committed during their generation. It is then a matter of practical conc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics of Computation

سال: 1991

ISSN: 0025-5718

DOI: 10.1090/s0025-5718-1991-1094957-9